Optimal Transportation with Capacity Constraints
نویسندگان
چکیده
The classical problem of optimal transportation can be formulated as a linear optimization problem on a convex domain: among all joint measures with fixed marginals find the optimal one, where optimality is measured against a cost function. Here we consider a natural but largely unexplored variant of this problem by imposing a pointwise constraint on the joint (absolutely continuous) measures: among all joint densities with fixed marginals and which are dominated by a given density, find the optimal one. For this variant, we show local non-degeneracy of the cost function implies every minimizer is extremal in the convex set of competitors, hence unique. An appendix develops rudiments of a duality theory for this problem, which allows us to compute several suggestive examples.
منابع مشابه
Parallel computation framework for optimizing trailer routes in bulk transportation
We consider a rich tanker trailer routing problem with stochastic transit times for chemicals and liquid bulk orders. A typical route of the tanker trailer comprises of sourcing a cleaned and prepped trailer from a pre-wash location, pickup and delivery of chemical orders, cleaning the tanker trailer at a post-wash location after order delivery and prepping for the next order. Unlike traditiona...
متن کاملOptimal Allocation of Ships to Quay Length in Container Ports
Due to the continuously increasing container trade, many terminals are presently operating at or close to capacity. An efficient terminal is one that facilitates the quick transshipment of containers to and from ships. In this sake, this paper addresses the ship assignments problem at a maritime container terminal, where ships are normally assigned to specific quay cranes until the work is fini...
متن کاملOptimal Trajectory of Flexible Manipulator with Maximum Load Carrying Capacity
In this paper, a new formulation along with numerical solution for the problem of finding a point-to-point trajectory with maximum load carrying capacities for flexible manipulators is proposed. For rigid manipulators, the major limiting factor in determining the Dynamic Load Carrying Capacity (DLCC) is the joint actuator capacity. The flexibility exhibited by light weight robots or by robots o...
متن کاملDual potentials for capacity constrained optimal transport
Optimal transportation with capacity constraints, a variant of the well-known optimal transportation problem, is concerned with transporting one probability density f ∈ L1(Rm) onto another one g ∈ L1(Rn) so as to optimize a cost function c ∈ L1(Rm+n) while respecting the capacity constraints 0 ≤ h ≤ h̄ ∈ L∞(Rm+n). A linear programming duality theorem for this problem was first established by Lev...
متن کاملIterative Bregman Projections for Regularized Transportation Problems
This article details a general numerical framework to approximate solutions to linear programs related to optimal transport. The general idea is to introduce an entropic regularization of the initial linear program. This regularized problem corresponds to a Kullback-Leibler Bregman divergence projection of a vector (representing some initial joint distribution) on the polytope of constraints. W...
متن کاملOptimal design of onboard energy storage systems with volume limitation for urban electrical rail transportation
Train braking energy regeneration in urban electrical rail transportation systems can reduce energy consumption and operational cost of the system. In this paper, optimal design of an onboard energy storage system (OESS) with volume constraint is presented for urban electrical rail transportation systems (ERTS). Onboard super-capacitors are considered as the storage system. The objective functi...
متن کامل